On Time-sensitive Control Dependencies

We present efficient algorithms for time-sensitive control dependencies (CDs). If statement y is time-sensitively dependent on x , then decides not only whether executed but also how many timesteps after . standard dependent, will always be the execution time between and varies. This allows us to discover, e.g., timing leaks in security-critical software. systematically develop properties CDs, as well nontermination-sensitive CDs. These work flow graphs (CFGs) CFGs lacking a unique exit node (e.g., reactive systems). show that Cytron’s algorithm dominance frontiers [ 10 ] can generalized allow computation just of classical CDs use slicing discover cache an AES implementation. Performance measurements demonstrate scalability approach.